Cryptanalysis of Substitution Ciphers Using Scatter Search
نویسندگان
چکیده
This paper presents an approach for the automated cryptanalysis of substitution ciphers based on a recent evolutionary metaheuristic called Scatter Search. It is a population-based metaheuristic founded on a formulation proposed two decades ago by Fred Glover. It uses linear combinations on a population subsets to create new solutions while other evolutionary approaches like genetic algorithms resort to randomization. First, we implement the procedures of the scatter search for the cryptanalysis of substitution and transposition ciphers. This implementation can be used as a framework for solving permutation problems with scatter search. Then, we test the algorithm and show the importance of the improvement method and the contribution of subset types. Finally, we compare its performances with those of a genetic algorithm. Key-Words. automated cryptanalysis, substitution and transposition ciphers, scatter search, evolutionary approach, heuristic search, genetic algorithm, optimization problem.
منابع مشابه
Automated Cryptanalysis of Monoalphabetic Substitution Ciphers Using Stochastic Optimization Algorithms
All forms of symmetric encryption take a key shared between a small group of people and encode data using this key so that only those with the key are able to decrypt it. Encryption algorithms tend to rely on problems that are computationally intractable for security, but even more generally these algorithms rely on a fundamental assumption: that the number of potential keys is so large that it...
متن کاملA new method for accelerating impossible differential cryptanalysis and its application on LBlock
Impossible differential cryptanalysis, the extension of differential cryptanalysis, is one of the most efficient attacks against block ciphers. This cryptanalysis method has been applied to most of the block ciphers and has shown significant results. Using structures, key schedule considerations, early abort, and pre-computation are some common methods to reduce complexities of this attack. In ...
متن کاملGenetic Algorithm and Tabu Search Attack on the Mono-Alphabetic Subsitution Cipher in Adhoc Networks
With exponential growth of networked system and application such as e-Commerce, the demand for effective Internet security is increasing. Cryptology is the science and study of systems for secret communication. In consists of two complementary fields of study: cryptography and cryptanalysis. This study presents a cryptanalysis method based on Genetic Algorithm and Tabu Search to break a Mono-Al...
متن کاملEfficient Cryptanalysis of Homophonic Substitution Ciphers
Substitution ciphers are among the earliest methods of encryption. Examples of classic substitution ciphers include the well-known simple substitution and the less well-known homophonic substitution. Simple substitution ciphers are indeed simple, both in terms of their use and their cryptanalysis. Homophonic substitutions—in which a plaintext symbol can map to more than one ciphertext symbol—ar...
متن کاملAn Evolutionary Approach for the Playfair Cipher Cryptanalysis
In this paper we describe the Playfair substitution cipher and we propose an evolutionary algorithm for Playfair’s cryptanalysis. The structural properties of the cipher and its enciphering rules determine the suitability of an evolutionary, genetic-like approach for the cipher’s cryptanalysis. Classical cryptographic ciphers like Playfair are no longer used in practice, but evolutionary approa...
متن کامل